Perfect Tree-like Markovian Distributions
نویسندگان
چکیده
We show that if a strictly positive joint probability distribution for a set of binary random variables factors according to a tree, then vertex separation represents all and only the independence relations encoded in the distribution. The same result is shown to hold also for multivariate strictly positive normal distributions. Our proof uses a new property of conditional independence that holds for these two classes of probability distributions.
منابع مشابه
Exact and approximate moment closures for non-Markovian network epidemics.
Moment-closure techniques are commonly used to generate low-dimensional deterministic models to approximate the average dynamics of stochastic systems on networks. The quality of such closures is usually difficult to asses and furthermore the relationship between model assumptions and closure accuracy are often difficult, if not impossible, to quantify. Here we carefully examine some commonly u...
متن کاملANALYSIS OF FINITE BUFFER RENEWAL INPUT QUEUE WITH BALKING AND MARKOVIAN SERVICE PROCESS
This paper presents the analysis of a renewal input finite buffer queue wherein the customers can decide either to join the queue with a probability or balk. The service process is Markovian service process ($MSP$) governed by an underlying $m$-state Markov chain. Employing the supplementary variable and imbedded Markov chain techniques, the steady-state system length distributions at pre...
متن کاملProcess algebra for performance evaluation
This paper surveys the theoretical developments in the field of stochastic process algebras, process algebras where action occurrences may be subject to a delay that is determined by a random variable. A huge class of resource-sharing systems — like large-scale computers, client-server architectures, networks — can accurately be described using such stochastic specification formalisms. The main...
متن کاملOn the link between Markovian trees and tree-structured Markov chains
In this paper, we describe a link between Markovian binary trees (MBT) and tree-like quasi-birth-anddeath processes (TLQBD) by associating a specific TLQBD to each MBT. The algorithms to compute the matrices Gk in the TLQBD then correspond to the algorithms calculating the extinction probability vector of the MBT. This parallelism leads to a new quadratic algorithm, based on the Newton iteratio...
متن کاملSplitting algorithms in channels with markovian capture
In this paper we study the performance of tree-like splitting collision resolution algorithms in channels with markovian capture. In particular, we assume that in each slot the channel can be in one of two states { b (for \bad") and g (for \good"). When the channel is in state b, a capture can never occur. When the channel is in state g and n nodes (n 2) are transmitting, a capture occurs with ...
متن کامل